On Minors of Maximal Determinant Matrices
نویسنده
چکیده
By an old result of Cohn (1965), a Hadamard matrix of order n has no proper Hadamard submatrix of order m > n/2. We generalize this result to maximal determinant submatrices of Hadamard matrices, and show that an interval of length ∼ n/2 is excluded from the allowable orders. We make a conjecture regarding a lower bound for sums of squares of minors of maximal determinant matrices, and give evidence to support it. We give tables of the values taken by the minors of all maximal determinant matrices of orders ≤ 21 and make some observations on the data. Finally, we describe the algorithms that were used to compute the tables.
منابع مشابه
General Lower Bounds on Maximal Determinants of Binary Matrices
We prove general lower bounds on the maximal determinant of n× n {+1,−1}matrices, both with and without the assumption of the Hadamard conjecture. Our bounds improve on earlier results of de Launey and Levin (2010) and, for certain congruence classes of n mod 4, the results of Koukouvinos, Mitrouli and Seberry (2000). In an Appendix we give a new proof, using Jacobi’s determinant identity, of a...
متن کاملOn Ideals of Minors of Matrices with Indeterminate Entries
This paper has two aims. The first is to study ideals of minors of matrices whose entries are among the variables of a polynomial ring. Specifically, we describe matrices whose ideals of minors of a given size are prime. The “generic” case, where all the entries are distinct variables has been studied extensively (cf. [1] and [2] for a thorough account.) While some special cases, such as catale...
متن کاملEla Determinants of Multidiagonal Matrices
Abstract. The formulas presented in [Molinari, L.G. Determinants of block tridiagonal matrices. Linear Algebra Appl., 2008; 429, 2221–2226] for evaluating the determinant of block tridiagonal matrices with (or without) corners are used to derive the determinant of any multidiagonal matrices with (or without) corners with some specified non-zero minors. Algorithms for calculation the determinant...
متن کاملOn the Ideal of Minors of Matrices of Linear Forms
The ideals generated by the minors of matrices whose entries are linear forms are not yet well-understood, unless the forms themselves satisfy some strong condition. One has a wealth of information if the matrix is generic, symmetric generic or Hankel; here we tackle 1-generic matrices. We recall the definition of 1-genericity introduced in [E2] by Eisenbud: Let F be a field and X1, . . . , Xs ...
متن کاملM ar 2 00 9 TRACE DIAGRAMS , MATRIX MINORS , AND DETERMINANT IDENTITIES
Trace diagrams are structured graphs with edges labeled by matrices. Each diagram has an interpretation as a particular multilinear function, allowing algebraic proofs to be made in the diagrammatic category. We provide a rigorous combinatorial definition of these diagrams, and prove that they may be efficiently represented in terms of matrix minors. Using this viewpoint, we provide new proofs ...
متن کامل